Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
نویسندگان
چکیده
Existential rules have been proposed for representing ontological knowledge, specifically in the context of OntologyBased Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the termination of a breadth-first forward chaining algorithm known as the chase. Several variants of the chase have been proposed. In the first part of this paper, we propose a new tool that allows to extend existing acyclicity conditions ensuring chase termination, while keeping good complexity properties. In the second part, we study the extension to existential rules with nonmonotonic negation under stable model semantics, discuss the relevancy of the chase variants for these rules and further extend acyclicity results obtained in the positive case.
منابع مشابه
Extending Acyclicity Notions for Existential Rules (\emph{long version})
Existential rules have been proposed for representing on-tological knowledge, specifically in the context of Ontology-BasedQuery Answering. Entailment with existential rules is undecidable.We focus in this paper on conditions that ensure the terminationof a breadth-first forward chaining algorithm known as the chase.First, we propose a new tool that allows to extend existing...
متن کاملRestricted Chase (Non)Termination for Existential Rules with Disjunctions
The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination. Our criteria cannot always detect termination (the problem is undecidable), and we develop the first cyclicity criteria to show non-termination of the restricted chase. Experiments on real-world ontol...
متن کاملNonmonotonic Existential Rules for Non-Tree-Shaped Ontological Modelling
Description logic (DL) formalisms are extensively used for ontological modelling, e.g., in biology [16] and chemistry [19]. One such example is the ChEBI ontology [20] – a reference terminology adopted by various biological databases for chemical annotation [23,8,10]. Despite their wide range of expressive features, DLs are severely limited in their ability to represent structures that are not ...
متن کاملTractable Query Answering for Expressive Ontologies and Existential Rules
The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existential rules. Even though acyclicity notions can be used to ensure chase termination for a large subset of real-world knowledge bases, the complexity of reasoning over acyclic theories still remains hi...
متن کاملAcyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a prominent problem in knowledge representation and databases. This problem can be solved using the chase algorithm, which extends the given set of facts with fresh facts in order to satisfy the rules. If the chase terminates, then CQs can be evaluated directly in the resulting set of facts. The chase, ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1405.1071 شماره
صفحات -
تاریخ انتشار 2014